- 1 - Computation of Discrete Logarithms in PrimeFieldsB
نویسندگان
چکیده
The presumed diiculty of computing discrete logarithms in nite elds is the basis of several popular public key cryptosystems. The secure identiication option of the Sun Network File System, for example, uses discrete logarithms in a eld GF(p) with p a prime of 192 bits. This paper describes an implementation of a discrete logarithm algorithm which shows that primes of under 200 bits, such as that in the Sun system, are very insecure. Some enhancements to this system are suggested.
منابع مشابه
Quantum computation of discrete logarithms in semigroups
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor’s algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete logarithms in semigroups are insecure against quantum attacks. In contrast, we show that some generalizations of the discrete log problem are hard in semigroup...
متن کاملDiscrete Logarithms: Recent Progress
We summarize recent developments on the computation of discrete logarithms in general groups as well as in some specialized settings. More specifically , we consider the following abelian groups: the multiplicative group of nite elds, the group of points of an elliptic curve over a nite eld, and the class group of quadratic number elds.
متن کاملComputing small discrete logarithms using optimized lookup tables
In our previous work Crux , we used an additively homomorphic elliptic-curve cryptosystem, based on El Gamal, to compute privacy-preserving statistics for the Tor network [4]. The decryption algorithm of our cryptographic scheme required the computation of a small discrete logarithm (DL). For small values, the computation of the DLP should have been trivial as an exhaustive search would quickly...
متن کاملReducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
Since nobody can guarantee that the computation of discrete logarithms in elliptic curves or IF p remains intractible for the future it is important to study cryptosystems based on alternative groups. A promising candidate, which was proposed by Buch-mann and Williams 8], is the class group C l(() of an imaginary quadratic order O. This ring is isomorphic to the endomorphism ring of a non-super...
متن کاملMassively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We discover several things that were previously overlooked in the implementation of Coppersmith’s algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991